Alternative Optimal Social Orders
نویسندگان
چکیده
منابع مشابه
Optimal Encoding of Partial Orders
This paper presents a method for optimal encoding of a given set of partial orders so that a Conditional Partial Order Graph containing all of them has the least possible total count of literals in all of its vertex and arc conditions, thus leading to the smallest and fastest controller. The presented method is implemented in a software tool for automated CPOG synthesis.
متن کاملOptimal trading strategies with limit orders
A model is proposed to study optimal trading strategies in a limit order book, as typically arise when a trader has a block of shares to liquidate and she submits limit orders. The execution of limit orders is uncertain, which leads to a stochastic control problem. In contrast to previous literature, we allow the trader to choose both the quotes and the sizes of her submitted orders. Great atte...
متن کاملOptimal batting orders in one-day cricket
This paper concerns the search for optimal or nearly optimal batting orders in one-day cricket. A search is conducted over the space of permutations of batting orders where simulated annealing is used to explore the space. A non-standard aspect of the optimization is that the objective function (which is the mean number of runs per innings) is unavailable and is approximated via simulation. The...
متن کاملOptimal Portfolio Liquidation with Limit Orders
This paper addresses the optimal scheduling of the liquidation of a portfolio using a new angle. Instead of focusing only on the scheduling aspect like Almgren and Chriss in [2], or only on the liquidity-consuming orders like Obizhaeva and Wang in [31], we link the optimal trade-schedule to the price of the limit orders that have to be sent to the limit order book to optimally liquidate a portf...
متن کاملOptimal shadows and ideals in submatrix orders
We consider the poset of all submatrices of a given matrix, ordered by containment. The unique rank function for this poset is given by r(M) = R(M)+C(M)?1, where R(M) and C(M) denote the number of rows and columns of a nonempty matrix M, respectively, and the rank of the empty matrix is 0. For xed k and i our objective is to nd a set M of submatrices M 1 ; M 2 ; : : :; M k such that r(M j) = i ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Pakistan Development Review
سال: 1984
ISSN: 0030-9729
DOI: 10.30541/v23i1pp.1-7